The Complexity of Hamiltonian Cycle Problem in Digraps with Degree Bound Two is Polynomial Time
نویسنده
چکیده
The incidence matrix of Cnm of a simple digraph is mapped into a incidence matrix F of a balanced bipartite undirected graph by divided C into two groups. Based on the mapping, it proves that the complexity is polynomial to determin a Hamiltonian cycle existence or not in a simple digraph with degree bound two and obtain all solution if it exists Hamiltonian cycle. It also proves P = NP with the different results in [1].
منابع مشابه
The Complexity of HCP in Digraps with Degree Bound Two
The Hamiltonian cycle problem (HCP) in digraphs D with degree bound two is solved by two mappings in this paper. The first bijection is between an incidence matrix Cnm of simple digraph and an incidence matrix F of balanced bipartite undirected graph G; The second mapping is from a perfect matching of G to a cycle of D. It proves that the complexity of HCP in D is polynomial, and finding a seco...
متن کاملA POLYNOMIAL TIME BRANCH AND BOUND ALGORITHM FOR THE SINGLE ITEM ECONOMIC LOT SIZING PROBLEM WITH ALL UNITS DISCOUNT AND RESALE
The purpose of this paper is to present a polynomial time algorithm which determines the lot sizes for purchase component in Material Requirement Planning (MRP) environments with deterministic time-phased demand with zero lead time. In this model, backlog is not permitted, the unit purchasing price is based on the all-units discount system and resale of the excess units is possible at the order...
متن کاملMinimizing Makespan with Start Time Dependent Jobs in a Two Machine Flow Shop
[if gte mso 9]> The purpose of this paper is to consider the problem of scheduling a set of start time-dependent jobs in a two-machine flow shop, in which the actual processing times of jobs increase linearly according to their starting time. The objective of this problem is to minimize the makespan. The problem is known to be NP-hardness[ah1] ; therefore, there is no polynomial-time algorithm...
متن کاملThe NP-Completeness of the Hamiltonian Cycle Problem in Planar Digraphs with Degree Bound Two
The notation and terminology follow Harary [4 1. A hamiltonian cycle in a graph or digraph is a cycle containing all the points. Thus any such cycle has p points as well asp lines (arcs) if the graph (digraph) has p points. No elegant characterization of the graphs or digraphs which possess hamiltonian cycies exists, although the problem is at least one hundred years old [4]. As the problem is ...
متن کاملA Full-NT Step Infeasible Interior-Point Algorithm for Mixed Symmetric Cone LCPs
An infeasible interior-point algorithm for mixed symmetric cone linear complementarity problems is proposed. Using the machinery of Euclidean Jordan algebras and Nesterov-Todd search direction, the convergence analysis of the algorithm is shown and proved. Moreover, we obtain a polynomial time complexity bound which matches the currently best known iteration bound for infeasible interior-point ...
متن کامل